Surfaces Intersection for Solids Algebra: a Classiication Algorithm
نویسندگان
چکیده
Detecting intersecting surfaces and computing their intersection curves is one of the fundamental problems in solid modeling algebra. This paper introduces a new strategy to classify surfaces against their intersection status, where exact geometric entities are replaced by fuzzy geometric ones. Intersecting surfaces are thus replaced by fuzzy intersecting faces and a fuzzy intersection algorithm provides a three-state classiication of surfaces couples: certainly intersecting, certainly non intersecting and potentially intersecting. In case of certainly intersecting surface couples the fuzzy intersection algorithm provides also starting points to march along the intersection curve, which turns most of the potentially intersecting couples in certainly intersecting ones. The remaining potential intersections are then subdivided to reene their status. Statistic shows the eeciency of this global strategy.
منابع مشابه
Surface/surface Intersections: a Three States Classification
Detecting intersecting surfaces and computing their intersection curves is one of the fundamental problems in solid modeling algebra. In this paper, we introduce a new strategy to classify surfaces against their intersection status. We replace exact geometric entities by fuzzy geometric ones. Intersecting surfaces are then replaced by fuzzy intersecting faces and their fuzzy intersection algori...
متن کاملComputing All Conic Sections in Torus and Natural Quadric Intersections
Conic sections embedded in a torus must be circles of special types: (i) proole circles, (ii) cross-sectional circles , and (iii) Yvone-Villarceau circles. Based on this classiication, we present eecient and robust geometric algorithms that detect and compute all degenerate conic sections (circles) in torus/plane and torus/natural-quadric intersections. 2 Introduction Simple surfaces (such as p...
متن کاملcient and Accurate B - rep Generation of Low Degree SculpturedSolids using Exact Arithmetic
We present eecient representations and algorithms for exact boundary computation on low degree sculptured CSG solids using exact arithmetic. Most of the previous work using exact arithmetic has been restricted to polyhedral models. In this paper, we generalize it to higher order objects , whose boundaries are composed of rational paramet-ric surfaces. The use of exact arithmetic and representat...
متن کاملEfficient and accurate B-rep generation of low degree sculptured solids using exact arithmetic: II - computation
We present eecient algorithms for exact boundary computation on low degree sculptured CSG solids using exact arithmetic. These include algorithms for computing the intersection curves of low-degree trimmed parametric surfaces, decomposing them into multiple components for eecient point location queries inside the trimmed regions, and computing the boundary of the resulting solid using topologic...
متن کاملA Marching Method for Computing Intersection Curves of Two Subdivision Solids
This paper presents a marching method for computing intersection curves between two solids represented by subdivision surfaces of Catmull-Clark or Loop type. It can be used in trimming and boolean operations for subdivision surfaces. The main idea is to apply a marching method with geometric interpretation to trace the intersection curves. We first determine all intersecting regions, then find ...
متن کامل